Covering a Square by Small Perimeter Rectangles
نویسندگان
چکیده
We show that if the unit square is covered by n rectangles, then at least one must have perimeter at least 4(2m + 1)/(n + m(m + 1)), where m is the largest integer whose square is at most n. This result is exact for n of the form m(m + 1) (or m2).
منابع مشابه
Partitioning a rectangle into small perimeter rectangles
Alon, N. and D.J. Kleitman, Partitioning a rectangle into small perimeter rectangles, Discrete Mathematics 103 (1992) 111-119. We show that the way to partition a unit square into kZ + s rectangles, for s = 1 or s = -1, so as to minimize the largest perimeter of the rectangles, is to have k 1 rows of k identical rectangles and one row of k + s identical rectangles, with all rectangles having th...
متن کاملMinimum perimeter rectangles that enclose congruent non-overlapping circles
We use computational experiments to find the rectangles of minimum perimeter into which a given number, n, of non-overlapping congruent circles can be packed. No assumption is made on the shape of the rectangles. In many of the packings found, the circles form the usual regular square-grid or hexagonal patterns or their hybrids. However, for most values of n in the tested range n ≤ 5000, e.g., ...
متن کاملHeterogeneous Matrix-Matrix Multiplication or Partitioning a Square into Rectangles: NP-Completeness and Approximation Algorithms
In this pape6 we deal with n ~ o geometric problems arising froin heterogeneous parallel computing: how to partition the unit square irito p rectangles of given area SI, sa, . . . sp (such that E:='=, s = l), so as to minimize (i) either the sum of the p perimeters of the rectangles (i i) or the largest perimeter of the p rectangles. For both problems, we prove NP-completeness and we introduce ...
متن کاملMaximising Neumann eigenvalues on rectangles
We obtain results for the spectral optimisation of Neumann eigenvalues on rectangles in R with a measure or perimeter constraint. We show that the rectangle with measure 1 which maximises the k’th Neumann eigenvalue converges to the unit square in the Hausdorff metric as k → ∞. Furthermore, we determine the unique maximiser of the k’th Neumann eigenvalue on a rectangle with given perimeter. AMS...
متن کاملThe Decomposition of a Rectangle into Rectangles of Minimal Perimeter
We solve the problem of decomposing a rectangle R into p rectangles of equal area so that the maximum rectangle perimeter is as small as possible. This work has applications in areas such as flexible object packing and data allocation. Our solution requires only a constant number of arithmetic operations and integer square roots to characterize the decomposition, and linear time to print the de...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Discrete & Computational Geometry
دوره 1 شماره
صفحات -
تاریخ انتشار 1986